Model based Detection and 3D Localization of Planar Objects for Industrial Setups

In this work we present a method to detect and estimate the three-dimensional pose of planar and textureless objects placed randomly on a conveyor belt or inside a bin. The method is based on analysis of single 2D images acquired by a standard camera. The algorithm exploits a template matching method to recognize the objects. A set of pose hypotheses are then refined and, based on a gradient orientation scoring, the best object to be manipulated is selected. The method is flexible and can be used with different objects without changing parameters since it exploits a CAD model as input for template generation. We validated the method using synthetic images. An experimental setup has been also designed using a fixed standard camera to localize planar metal objects in various scenarios

Homotopy aware kinodynamic planning using RRT-based planners

This paper introduces a method for kinodynamic planning with homotopy class constraints, and proposes a homotopy class identifier that establishes a geometric relation between a trajectory and a union of convex partitions of the 2D robot workspace. The proposed identifier is shown to be invariant with respect to the trajectories that belong to the same homotopy class, in such a way that each class has its own unique signature. Furthermore, we show that the proposed homotopy class identifier can be easily incorporated in a RRT-based planner, without changing the planning algorithm, while restricting the solution trajectories to a designated homotopy class

Safe motion planning for a mobile robot navigating in environments shared with humans

Abstract In this paper, a robot navigating an environment shared with humans is considered, and a cost function that can be exploited in RRT X, a randomized sampling-based replanning algorithm that guarantees asymptotic optimality, to allow for a safe motion is proposed. The cost function is a path length weighted by a danger index based on a prediction of human motion performed using either a linear stochastic model, assuming constant longitudinal velocity and varying lateral velocity, and a GMM/GMR-based model, computed on an experimental dataset of human trajectories. The proposed approach is validated using a dataset of human trajectories collected in a real world setting

Complete path planning that simultaneously optimizes length and clearance

Abstract This paper considers a fundamental, optimal path planning problem that requires simultaneously minimizing path length and maximizing obstacle clearance. We show that in even simple planar settings with point and disc obstacles, the set of alternative solutions such that no one is clearly better than another (the set of Pareto-optimal solutions) is uncountably infinite. In spite of this difficulty, we introduce a complete, efficient algorithm that computes the Pareto front and a data structure that finitely represents the complete set of all Pareto- optimal paths. Particular optimal paths can then be selected from the computed data structure during execution, based on any additional conditions or considerations

Using motion primitives to enforce vehicle motion constraints in sampling-based optimal planners

This paper presents a newly conceived planning algorithm that is based on the introduction of motion primitives in RRT*. Online computational complexity of RRT* is greatly reduced by pre-computing the optimal constrained trajectories joining pairs of starting and destination configurations in a grid space, while taking into account vehicle motion constraints in the planning task. A numerical example shows the effectiveness of the algorithm

An Admissible Heuristic to Improve Convergence in Kinodynamic Planners Using Motion Primitives

This letter introduces a new heuristic function that can be incorporated in any kinodynamic planner using motion primitives, to the purpose of increasing its convergence rate. The heuristic function is proven to be admissible and, hence, the optimality properties of the planning algorithm are preserved. Notably, it can be applied to planning problems with generic agent motion models and cost criteria, since it depends only on the database of motion primitives. The proposed heuristic has been integrated into a randomized sampling-based and a deterministic kinodynamic planner, and its effectiveness has been shown in numerical examples with different agent motion models and cost criteria

An enactivist-inspired mathematical model of cognition

Abstract In this paper we start from the philosophical position in cognitive science known as enactivism. We formulate five basic enactivist tenets that we have carefully identified in the relevant literature as the main underlying principles of that philosophy. We then develop a mathematical framework to talk about cognitive systems (both artificial and natural) which complies with these enactivist tenets. In particular we pay attention that our mathematical modeling does not attribute contentful symbolic representations to the agents, and that the agent’s nervous system or brain, body and environment are modeled in a way that makes them an inseparable part of a greater totality. The long-term purpose for which this article sets the stage is to create a mathematical foundation for cognition which is in line with enactivism. We see two main benefits of doing so: (1) It enables enactivist ideas to be more accessible for computer scientists, AI researchers, roboticists, cognitive scientists, and psychologists, and (2) it gives the philosophers a mathematical tool which can be used to clarify their notions and help with their debates. Our main notion is that of a sensorimotor system which is a special case of a well studied notion of a transition system. We also consider related notions such as labeled transition systems and deterministic automata. We analyze a notion called sufficiency and show that it is a very good candidate for a foundational notion in the “mathematics of cognition from an enactivist perspective.” We demonstrate its importance by proving a uniqueness theorem about the minimal sufficient refinements (which correspond in some sense to an optimal attunement of an organism to its environment) and by showing that sufficiency corresponds to known notions such as sufficient history information spaces. In the end, we tie it all back to the enactivist tenets

Damping oscillations in a wire bending process

This paper presents an approach to modify CAD/CAM generated motion profiles for wire bending machines, in order to damp wire oscillations without decreasing machine throughput. Two different methodologies are presented, both leveraging on a simple and easily identifiable model of wire oscillations, the first one based on a filtering approach, the second one on an optimisation approach. The two methodologies are both characterised by a low computational complexity, allowing them to be integrated directly in the bending machine user interface, and can rely on a standard camera to identify wire oscillation parameters. A thorough experimental validation of the approaches is also presented, showing promising results in damping oscillations with wires of different materials

Visibility-inspired models of touch sensors for navigation

Abstract This paper introduces mathematical models of touch sensors for mobile robots based on visibility. Serving a purpose similar to the pinhole camera model for computer vision, the introduced models are expected to provide a useful, idealized characterization of task-relevant information that can be inferred from their outputs or observations. Possible tasks include navigation, localization and mapping when a mobile robot is deployed in an unknown environment. These models allow direct comparisons to be made between traditional depth sensors, highlighting cases in which touch sensing may be interchangeable with time of flight or vision sensors, and char-acterizing unique advantages provided by touch sensing. The models include contact detection, compression, load bearing, and deflection. The results could serve as a basic building block for innovative touch sensor designs for mobile robot sensor fusion systems

HI-DWA:human-influenced dynamic window approach for shared control of a telepresence robot

Abstract This paper considers the problem of enabling the user to modify the path of a telepresence robot. The robot is capable of autonomously navigating to a goal predefined by the user, but the user might still want to modify the path, for example, to go further away from other people, or to go closer to landmarks she wants to see on the way. We propose Human-Influenced Dynamic Window Approach (HI-DWA), a shared control method aimed for telepresence robots based on Dynamic Window Approach (DWA) that allows the user to influence the control input given to the robot. To verify the proposed method, we performed a user study (N=32) in Virtual Reality (VR) to compare HI-DWA with switching between autonomous navigation and manual control for controlling a simulated telepresence robot moving in a virtual environment. Results showed that users reached their goal faster using HI-DWA controller and found it easier to use. Preference between the two methods was split equally. Qualitative analysis revealed that a major reason for the participants that preferred switching between two modes was the feeling of control. We also analyzed the effect of different input methods, joystick and gesture, on the preference and perceived workload